Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
921	Improvement of the E ien y of Geneti Algorithms for S alable Parallel Graph Partitioning in a Multi-Level Framework Cédri Chevalier and François Pellegrini LaBRI and INRIA Futurs Add to Reading List Source URL: www.labri.fr Language: English - Date: 2006-05-21 08:07:32 NP-complete problems Applied mathematics Degree Topological graph theory Graph partition Theoretical computer science Mathematics Graph theory
922	Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:36:36 Automata theory NP-complete problems Graph coloring Graph theory Boolean satisfiability problem Deterministic finite automaton Clique DFA Records Powerset construction Theoretical computer science Mathematics Applied mathematics
923	Perpetual’s Term Fund Perpetual Investment Management Limited ABN[removed]AFSL[removed]Change of account details and instructions form Please complete this form in black ink using BLOCK letters. Add to Reading List Source URL: www.perpetual.com.au Language: English - Date: 2013-05-30 20:41:18 Group action Group theory Symmetry Financial adviser G factor Business Money Investment Financial services Economics
924	Introduction Basic Economy Ramsey Allocations Add to Reading List Source URL: federation.ens.fr Language: English - Date: 2012-09-26 08:00:05 Controllability Incomplete markets General equilibrium theory Knowledge Tax Optimal tax Wealth tax Complete market Insurance Economics Control theory Game theory
925	Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest IPB & LaBRI, UMR CNRS 5800 Add to Reading List Source URL: gforge.inria.fr Language: English NP-complete problems Scotch Shortest path problem Graph partition Algorithm Nested dissection Graph Mathematics Theoretical computer science Graph theory
926	Using a satisfiability solver to identify deterministic finite state automata Marijn J.H. Heule Sicco Verwer Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-08-19 05:30:10 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Graph coloring SL NP-complete Theoretical computer science Mathematics Computational complexity theory
927	This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2011-12-23 16:23:54 NP-complete problems Clique Network coding Shortest path problem Maximal independent set Path decomposition Graph theory Theoretical computer science Mathematics
928	Turkish Journal of Analysis and Number Theory, 2013, Vol. 1, No. 1, 13-16 Available online at http://pubs.sciepub.com/tjant/1/1/4 © Science and Education Publishing DOI:[removed]tjant[removed]On Some Well Known Fixed Poi Add to Reading List Source URL: www.sciepub.com Language: English Space Topology Banach fixed-point theorem Contraction mapping Metric space Continuous mapping theorem Complete metric space Triangle inequality Metric Geometry Metric geometry Mathematics
929	Poset models of topological spaces Dongsheng Zhao Abstract. We consider poset models of topological spaces and show that every T1 -space has an bounded complete algebraic poset model, thus give a positive answer to a que Add to Reading List Source URL: math.nie.edu.sg Language: English - Date: 2010-07-05 04:28:20 Topology Complete partial order Filter Partially ordered set Domain theory Ideal Uniform space Metric space Lattice Order theory Mathematics Structure
930	DIHEDRAL COVERS OF THE COMPLETE GRAPH K5 M. GHASEMI Abstract. A regular cover of a connected graph is called dihedral if its transformation group is dihedral. In this paper, the author classifies all dihedral coverings o Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2014-05-27 07:51:07 Symmetric graph Petersen graph Covering graph Voltage graph Orbifold Graph theory Algebraic graph theory Graph

UPDATE